Namba forcing and no good scale

نویسنده

  • John Krueger
چکیده

We develop a version of Namba forcing which is useful for constructing models with no good scale on אω . A model is produced in which אn holds for all finite n ≥ 1, but there is no good scale on אω ; this strengthens a theorem of Cummings, Foreman, and Magidor [3] on the non-compactness of

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subcomplete Forcing and L-Forcing

ABSRACT In his book Proper Forcing (1982) Shelah introduced three classes of forcings (complete, proper, and semi-proper) and proved a strong iteration theorem for each of them: The first two are closed under countable support iterations. The latter is closed under revised countable support iterations subject to certain standard restraints. These theorems have been heavily used in modern set th...

متن کامل

Kurepa trees and Namba forcing

We show that compact cardinals and MM are sensitive to λ-closed forcings for arbitrarily large λ. This is done by adding ‘regressive’ λ-Kurepa-trees in either case. We argue that the destruction of regressive Kurepa-trees with MM requires the use of Namba forcing.

متن کامل

Increasing δ 12 and Namba - style forcing ∗ Richard

We isolate a forcing which increases the value of δ 2 while preserving ω1 under the assumption that there is a precipitous ideal on ω1 and a measurable cardinal.

متن کامل

A variant of Namba Forcing

Ronald Jensen asked whether it is possible to change cofinality of every regular cardinal between א1 and an inaccessible λ to ω preserving λ (and of course א1). We show that it is possible assuming large cardinals.

متن کامل

Complete forcing numbers of polyphenyl systems

The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 78  شماره 

صفحات  -

تاریخ انتشار 2013